Adaptive Quickest Change Detection with Unknown Parameters
نویسندگان
چکیده
In this report quickest detection of an abrupt distribution change with unknown time varying parameters is considered. A novel adaptive approach, Adaptive CUSUM Test, is proposed to tackle this problem, which is shown to outperform the celebrated Parallel CUSUM Test. Performance is evaluated through theoretical analysis and numerical simulations.
منابع مشابه
Adaptive Signal Detection in Auto-Regressive Interference with Gaussian Spectrum
A detector for the case of a radar target with known Doppler and unknown complex amplitude in complex Gaussian noise with unknown parameters has been derived. The detector assumes that the noise is an Auto-Regressive (AR) process with Gaussian autocorrelation function which is a suitable model for ground clutter in most scenarios involving airborne radars. The detector estimates the unknown...
متن کاملQuickest Change Detection under Transient Dynamics: Theory and Asymptotic Analysis
The problem of quickest change detection (QCD) under transient dynamics is studied, where the change from the initial distribution to the final persistent distribution does not happen instantaneously, but after a series of transient phases. The observations within the different phases are generated by different distributions. The objective is to detect the change as quickly as possible, while c...
متن کاملQuickest Change Detection with Mismatched Post-Change Models
In this paper, we study the quickest change detection with mismatched post-change models. A change point is the time instant at which the distribution of a random process changes. The objective of quickest change detection is to minimize the detection delay of an unknown change point under certain performance constraints, such as average run length (ARL) to false alarm or probability of false a...
متن کاملQuickest Change Detection in Hidden Markov Models for Sensor Networks
The decentralized quickest change detection problem is studied in sensor networks, where a set of sensors receive observations from a hidden Markov model (HMM) X and send sensor messages to a central processor, called the fusion center, which makes a final decision when observations are stopped. It is assumed that the parameter θ in the hidden Markov model for X changes from θ0 to θ1 at some un...
متن کاملAsymptotically Optimal Quickest Change Detection in Distributed Sensor Systems
In the standard formulation of the quickest change-point detection problem, a sequence of observations, whose distribution changes at some unknown point in time, is available to a decision maker, and the goal is to detect this change as quickly as possible, subject to false alarm constraints. In this paper, we study the quickest change detection problem in the setting where the information avai...
متن کامل